package com.acyouzi.leetcode.array;

/**
 * 17/9/20 22:10
 *
 * @author sunxu
 */
//https://leetcode.com/problems/continuous-subarray-sum/description/
public class ContinuousSubarraySum {
//  若数字a和b分别除以数字c，若得到的余数相同，那么(a-b)必定能够整除c。
  public boolean checkSubarraySum(int[] nums, int k) {
    return false;
  }
}
